Morphological Complexity outside of Universal Grammar1

نویسندگان

  • Jirka Hana
  • Peter W. Culicover
  • PETER W. CULICOVER
چکیده

There are many logical possibilities for marking morphological features. However only some of them are attested in languages of the world, and out of them some are more frequent than others. For example, it has been observed (Sapir 1921; Greenberg 1957; Hawkins & Gilligan 1988) that inflectional morphology tends to overwhelmingly involve suffixation rather than prefixation. This paper proposes an explanation for this asymmetry in terms of acquisition complexity. The complexity measure is based on the Levenshtein edit distance, modified to reflect human memory limitations and the fact that language occurs in time. This measure produces some interesting predictions: for example, it predicts correctly the prefix-suffix asymmetry and shows mirror image morphology to be virtually impossible. 1We thank Chris Brew, Beth Hume, Brian Joseph, John Nerbonne and 3 anonymous reviewers from the Cognitive Science Journal for valuable feedback on various versions of this paper. We also thank to Mary Beckman and Shari Speer. Jirka Hana & Peter W. Culicover. Morphological Complexity Outside of Universal Grammar. OSUWPL, Volume 58, Spring 2008, pp. 85–109. 86 JIRKA HANA & PETER W. CULICOVER

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Will Universal Health Coverage (UHC) Lead to the Freedom to Lead Flourishing and Healthy Lives?; Comment on “Inequities in the Freedom to Lead a Flourishing and Healthy Life: Issues for Healthy Public Policy”

The focus on public policy and health equity is discussed in reference to the current global health policy discussion on Universal Health Coverage (UHC). This initiative has strong commitment from the leadership of the international organizations involved, but a lack of policy clarity outside of the health financing component may limit the initiative’s impact on health inequity. In order to add...

متن کامل

Morphological Complexity Outside of Universal Grammar

There are many logical possibilities for marking morphological features. However only some of them are attested in languages of the world, and out of them some are more frequent than others. For example, it has been observed (Sapir, 1921; Greenberg, 1957; Hawkins & Gilligan, 1988) that inflectional morphology tends to overwhelmingly involve suffixation rather than prefixation. This paper propos...

متن کامل

Universal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?

  Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...

متن کامل

Machine learning theory and practice as a source of insight into universal grammar1

In this paper, we explore the possibility that machine learning approaches to naturallanguage processing (NLP) being developed in engineering-oriented computational linguistics (CL) may be able to provide specific scientific insights into the nature of human language. We argue that, in principle, machine learning (ML) results could inform basic debates about language, in one area at least, and ...

متن کامل

Quantum lower bound for recursive fourier sampling

We revisit the oft-neglected ‘recursive Fourier sampling’ (RFS) problem, introduced by Bernstein and Vazirani to prove an oracle separation between BPP and BQP. We show that the known quantum algorithm for RFS is essentially optimal, despite its seemingly wasteful need to uncompute information. This implies that, to place BQP outside of PH [log] relative to an oracle, one needs to go outside th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008